Enhancing Sub Graph Matching With Set Correlation Technique in Large Graph Database
نویسندگان
چکیده
منابع مشابه
Top-K Correlation Sub-graph Search in Graph Databases
Recently, due to its wide applications, (similar) subgraph search has attracted a lot of attentions from database and data mining community, such as [13, 18, 19, 5]. In [8], Ke et al. first proposed correlation sub-graph search problem (CGSearch for short) to capture the underlying dependency between subgraphs in a graph database, that is CGS algorithm. However, CGS algorithm requires the speci...
متن کاملTime-Constrained Graph Pattern Matching in a Large Temporal Graph
Graph pattern matching(GPM) is an important operation on graph computation. Most existing work assumes that query graph or data graph is static, which is contrary to the fact that graphs in real life are intrinsically dynamic. Therefore, in this paper, we propose a new problem of Time-Constrained Graph Pattern Matching(TCGPM) in a large temporal graph. Different from traditional work, our work ...
متن کاملAn Rule Based Mining Database with Similarityon Large Probabilistic Graph Matching
-Mining frequent itemsets is an active area in data mining that aims at searching interesting relationships between items in databases. It can be used to address to a wide variety of problems such as discovering association rules, sequential patterns, correlations and much more. Existing methods often generate a huge set of potential high utility item sets and their mining performance is degrad...
متن کاملAttack Graph to Graph Database
Databases are an integral part of almost any computing system today, and users heavily rely on the services they provide. When we interact with a computing system, we expect that any data be stored for future use, that the data is able to be looked up quickly, and that we can perform complex queries against the data stored in the database. There are many different emerging database types availa...
متن کاملMultiple Graph Matching with BayesianInferenceMark
This paper describes the development of a Bayesian framework for multiple graph matching. The study is motivated by the plethora of multi-sensor fusion problems which can be abstracted as multiple graph matching tasks. The study uses as its starting point the Bayesian consistency measure recently developed by Wilson and Hancock. Hitherto , the consistency measure has been used exclusively in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering & Technology
سال: 2018
ISSN: 2227-524X
DOI: 10.14419/ijet.v7i4.5.20000